Exponentially Faster Shortest Paths in the Congested Clique
نویسندگان
چکیده
We present improved deterministic algorithms for approximating shortest paths in the Congested Clique model of distributed computing. obtain poly(log log n )-round following problems unweighted undirected -vertex graphs: ( 1 + ϵ )-approximation multi-source (MSSP) from O (√ ) sources. (2 all pairs (APSP). (1 , β)-approximation APSP where β = (log / . These bounds improve exponentially over state-of-the-art poly-logarithmic due to [Censor-Hillel et al., PODC19]. It also provides first nearly-additive problem sub-polynomial time. Our approach is based on distinguishing between short and long distances some distance threshold t Handling done by devising a new algorithm computing sparse emulator with edges. For distances, we provide distance-sensitive variants tool-kit By exploiting fact that this should be applied only local balls radius their round complexities get poly ). Finally, our solutions these are derandomization scheme novel variant hitting set problem, which might independent interest.
منابع مشابه
Faster Batched Shortest Paths in Road Networks
We study the problem of computing batched shortest paths in road networks efficiently. Our focus is on computing paths from a single source to multiple targets (one-to-many queries). We perform a comprehensive experimental comparison of several approaches, including new ones. We conclude that a new extension of PHAST (a recent one-to-all algorithm), called RPHAST, has the best performance in mo...
متن کاملFaster shortest paths in dense distance graphs, with applications
We show how to combine two techniques for efficiently computing shortest paths in directed planar graphs. The first is the linear-time shortest-path algorithm of Henzinger, Klein, Subramanian, and Rao [STOC’94]. The second is Fakcharoenphol and Rao’s algorithm [FOCS’01] for emulating Dijkstra’s algorithm on the dense distance graph (DDG). A DDG is defined for a decomposition of a planar graph G...
متن کاملGraph Reconstruction in the Congested Clique
The congested clique model is a message-passing model of distributed computation where the underlying communication network is the complete graph of n nodes. In this paper we consider the situation where the joint input to the nodes is an nnode labeled graph G, i.e., the local input received by each node is the indicator function of its neighborhood in G. Nodes execute an algorithm, communicati...
متن کاملDeterministic MST Sparsification in the Congested Clique
We give a simple deterministic constant-round algorithm in the congested clique model for reducing the number of edges in a graph to n1+ε while preserving the minimum spanning forest, where ε > 0 is any constant. This implies that in the congested clique model, it is sufficient to improve MST and other connectivity algorithms on graphs with slightly superlinear number of edges to obtain a gener...
متن کاملShortest paths between shortest paths
We study the following problem on recon guring shortest paths in graphs: Given two shortest st paths, what is the minimum number of steps required to transform one into the other, where each intermediate path must also be a shortest s-t path and must di er from the previous one by only one vertex. We prove that the shortest recon guration sequence can be exponential in the size of the graph and...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of the ACM
سال: 2022
ISSN: ['0004-5411', '1557-735X']
DOI: https://doi.org/10.1145/3527213